Back to course home
0% completed
Vote For New Content
Tree Depth First Search (DFS) Pattern (medium)
Introduction to Tree Depth First Search Pattern
Binary Tree Path Sum (easy)
Solution: Binary Tree Path Sum
Count Good Nodes in Binary Tree (medium)
Solution: Count Good Nodes in Binary Tree
Path Sum III (medium)
Solution: Path Sum III
Validate Binary Search Tree (medium)
Solution: Validate Binary Search Tree
Maximum Difference Between Node and Ancestor (medium)
Solution: Maximum Difference Between Node and Ancestor
Root to Leaf Path Pattern (medium)
Introduction to Root to Leaf Path Pattern
Binary Tree Paths (easy)
Solution: Binary Tree Paths
Sum of Root To Leaf Binary Numbers (easy)
Solution: Sum of Root To Leaf Binary Numbers
Insufficient Nodes in Root to Leaf Paths (medium)
Solution: Insufficient Nodes in Root to Leaf Paths
Smallest String Starting From Leaf (medium)
Solution: Smallest String Starting From Leaf
Pseudo-Palindromic Paths in a Binary Tree (medium)
Solution: Pseudo-Palindromic Paths in a Binary Tree
All Paths for a Sum (medium)
Solution: All Paths for a Sum
Sum of Path Numbers (medium)
Solution: Sum of Path Numbers
Path With Given Sequence (medium)
Solution: Path With Given Sequence
Count Paths for a Sum (medium)
Solution: Count Paths for a Sum
Leaf Processing Pattern (medium)
Introduction to Leaf Processing Pattern
Sum of Left Leaves (easy)
Solution: Sum of Left Leaves
Leaf-Similar Trees (easy)
Solution: Leaf-Similar Trees
Check if all leaves are at same level (medium)
Solution: Check if all leaves are at same level
Delete Leaves With a Given Value (medium)
Solution: Delete Leaves With a Given Value
Deepest Leaves Sum (medium)
Solution: Deepest Leaves Sum
Tree View Pattern (medium)
Introduction to Tree View Pattern
Right View of a Binary Tree (medium)
Solution: Right View of a Binary Tree
Top View Of the Binary Tree (medium)
Solution: Top View Of the Binary Tree
Bottom View Of the Binary Tree (medium)
Solution: Bottom View Of the Binary Tree
Boundary of Binary Tree (medium)
Solution: Boundary of Binary Tree
Comparison of Two Trees Pattern (medium)
Introduction to Comparison of Two Trees Pattern
Symmetric Tree (easy)
Solution: Symmetric Tree
Mirror Image Trees (medium)
Solution: Mirror Image Trees
Subtree of Another Tree (easy)
Solution: Subtree of Another Tree
Isomorphic Trees (medium)
Solution: Isomorphic Trees
Serialize and Deserialize Tree Pattern (hard)
Introduction to Serialize and Deserialize Tree Pattern
Serialize and Deserialize BST (medium)
Solution: Serialize and Deserialize BST
Verify Preorder Serialization of a Binary Tree (medium)
Solution: Verify Preorder Serialization of a Binary Tree
Create Binary Tree From Descriptions (medium)
Solution: Create Binary Tree From Descriptions
Serialize and Deserialize N-ary Tree (hard)
Solution: Serialize and Deserialize N-ary Tree
Sum of Nodes with Even-Valued Grandparent (medium)
Problem Statement
Given the root of a binary tree, return the total sum of the values of all nodes that have a grandparent with an even number. If no such nodes exist, return 0.
A grandparent of a node is defined as the parent of its parent, if both exist.
Examples
Example 1:
- Input: root =
[4, 2, 6, 3, 5, null, 8] - Expected Output:
16
- Justification: Node values
3,5, and8have4as their grandparent. Since4is even, their sum is3 + 5 + 8 = 16.
Example 2:
- Input: root =
[2, 3, 8, null, 5, 7, null, 2, 3, 4, 5] - Expected Output:
21
- Justification: Node value
5and7has2as its grandparent, and Node value4and5has grandparent8. So, sum = 5 + 7 + 4 + 5 = 21.
Example 3:
- Input: root =
[5, 9, 12, null, null, 8, 4] - Expected Output:
0
- Justification: Node values
8and4has5as its grandparent. However, since5is not even, they are not included. So, the answer is0.
Constraints:
- The number of nodes in the tree is in the range [1, 104].
- 1 <= Node.val <= 100
Try it yourself
Try solving this question here:
Java
Saved to Cloud
. . . .
Introduction to Tree Breadth First Search Pattern
Solution: Sum of Nodes with Even-Valued Grandparent
Mark as Completed
On this page
Problem Statement
Examples
Try it yourself